TAG derivation as monotonic C-command

نویسندگان

  • Robert Frank
  • K. Vijay-Shanker
چکیده

The TAG adjunction operation operates by splitting a tree at one node, which we will call the adjunction site. In the resulting structure, the sub-trees above and below the adjunction site are separated by, and connected with, the auxiliary tree used in the composition. As the adjunction site is thus split into two nodes, with a copy in each subtree, a natural way of formalizing the adjunction operation posits that each potential adjunction site is in fact represented by two distinct nodes. In the FTAG formalism (Vijay-Shanker, 1988) each potential adjunction site is associated with two feature structures , one for each copy. As an alternative to this operationally deened rewriting view of adjunction, Vijay-Shanker (1992) suggests that TAG derivations instead be viewed as a monotonic growth of structural assertions that characterize the structures being composed. This proposal rests crucially on the assumption that the elementary trees are characterized in terms of a domination relation among nodes, and that each potential adjunction site is represented by two nodes standing in a domination relation. Under this proposal, the structures and in Figure 1 would be used to derive long-distance wh-movement. To adjoin into , the root and foot nodes of are identiied with the two C 0 nodes standing in a domination relation in (represented by the dotted line). This domination relation still holds after adjunction, as do all the other domination relations stated in deening and. (In sentences in which there is no adjoining at the C 0 node, e.g., `I wonder what Mary saw,' these C 0 nodes could collapse, preserving domination under the assumption that it is a reeexive relation.) Domination has also been argued to play a role in multi-component structures, where there is assumed to be a domination relationship between a frontier node of one component and the root of the other. While the use of domination relationships is attractive in allowing us to view TAG derivations as Thanks to Tony Kroch, Seth Kulick, and two anonymous reviewers for helpful comments and discussion. We gratefully acknowledge the nancial support of NSF grants SBR-97-10247 and SBR-97-10411. monotonic additions to a set of domination relations, the linguistic motivation for such domination statements among duplicated nodes is not very clear. Instead , from the point of view of the grammar, what seems to be crucial in deening the relevant portion of the structure of is not that there should …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonic C-Command: A New Perspective on Tree Adjoining Grammar

In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the combinatory operation is substitution. We show how the formalism we sketch resolves a number of problems for TAG that have been identified in the literature. Additionally, we demonstrate that our proposal is preferable...

متن کامل

Preserving Semantic Dependencies in Synchronous Tree Adjoining Grammar

Rambow, Wier and Vijay-Shanker (Rambow et al., 1995) point out the di erences between TAG derivation structures and semantic or predicateargument dependencies, and Joshi and VijayShanker (Joshi and Vijay-Shanker, 1999) describe a monotonic compositional semantics based on attachment order that represents the desired dependencies of a derivation without underspecifying predicate-argument relatio...

متن کامل

C-Command and Extraction in Tree Adjoining Grammar

A number of problems for the Tree Adjoining Grammar (TAG) formalism have been identi-ed in the literature. In this paper we argue for a reconceptualization of the TAG formalism, in which the elementary structures are collections of c-command relations, and the combina-tory operation is substitution. We demonstrate how the formalism we sketch, though similar in certain respects to D-tree grammar...

متن کامل

TAG Derivation as Monotonie C-Command*

The TAG adjunction operation operates by splitting a tree at one node, which we will call the adjunction site. In the resulting structure, the subtrees above and below the adjunction site are separated by, and connected with, the auxiliary tree used in the composition. As the adjunction site is thus split into two nodes, with a copy in each subtree, a natural way of formalizing the adjunction o...

متن کامل

Categorial Grammar and the Semantics of Contextual Prepositional Phrases

The paper proposes a semantics for contextual (i.e., Temporal and Locative) Prepositional Phrases (CPPs) like during every meeting, in the garden, when Harry met Sally and where I’m calling from. The semantics is embodied in a multi-modal extension of Combinatory Categoral Grammar (CCG). The grammar allows the strictly monotonic compositional derivation of multiple correct interpretations for “...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998